The P ne NP conjecture in the context of real and complex analysis

In this paper we aim at an analog characterization of the classical P 6= NP conjecture of Structural Complexity. We consider functions over continuous real and complex valued variables. Subclasses of functions can be defined using Laplace transforms adapted to continuous-time computation, introducing analog classes DAnalog and NAnalog. We then show that if DAnalog 6= NAnalog then P 6= NP .